Approximation algorithms for dynamic resource allocation

We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility.     

Heuristic Solution Methods for the Multilevel Generalized Assignment Problem

The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective.     

几率量子隐形传态的离子阱方案

本文提出了一个在分别囚禁于不同离子阱中的两个离子间实现几率量子隐形传态的简单方案,Alice对离子1和离子2的内态进行联合测量并通过经典通道告诉Bob测量结果,Bob利用一束经典驻波场激光与离子3相互作用并控制相互作用的时间就能够在离子3上最佳几率地重现离子1的初始内态.     

Regular population monotonic allocation schemes

The paper introduces a refinement of the notion of population monotonic allocation scheme, called regular population monotonic allocation scheme (regularpmas). This refinement is based on economic situations in which players may have to select new partners from a set of potential players and in which there exist certain capacity constraints. A sufficient condition for the existence of a regularpmas is given. For the class of games with regularpmas, we prove that the core coincides with the Davis and Maschler and the Mas-Colell bargaining sets.     

纠缠相干态的量子隐形传态

提出利用双模纠缠相干态作为量子信道，实现纠缠相干态量子隐形传态的方案. 分别在非正交的相干态表象和另一个由相干态构成的正交态表象对双模纠缠相干态的隐形传态进行具体分析. 发现在相干态表象，虽然只要线性光学元件就可以完成隐形传态，但成功的概率小于1/2，而在正交态表象，只要能分辨4个由相干态构成的Bell态，成功的概率就是1. 关键词： 隐形传态 纠缠相干态 纠缠相干态量子信道     

Numerical analysis of turbulent structure in compound meandering open channel by algebraic Reynolds stress model

The turbulent flow in a compound meandering channel with a rectangular cross section is one of the most complicated turbulent flows, because the flow behaviour is influenced by several kinds of forces, including centrifugal forces, pressure‐driven forces and shear stresses generated by momentum transfer between the main channel and the flood plain. Numerical analysis has been performed for the fully developed turbulent flow in a compound meandering open‐channel flow using an algebraic Reynolds stress model. The boundary‐fitted coordinate system is introduced as a method for coordinate transformation in order to set the boundary conditions along the complicated shape of the meandering open channel. The turbulence model consists of transport equations for turbulent energy and dissipation, in conjunction with an algebraic stress model based on the Reynolds stress transport equations. With reference to the pressure–strain term, we have made use of a modified pressure–strain term. The boundary condition of the fluctuating vertical velocity is set to zero not only for the free surface, but also for computational grid points next to the free surface, because experimental results have shown that the fluctuating vertical velocity approaches zero near the free surface. In order to examine the validity of the present numerical method and the turbulent model, the calculated results are compared with experimental data measured by laser Doppler anemometer. In addition, the compound meandering open channel is clarified somewhat based on the calculated results. As a result of the analysis, the present algebraic Reynolds stress model is shown to be able to reasonably predict the turbulent flow in a compound meandering open channel. Copyright © 2005 John Wiley & Sons, Ltd.     

强流束晕-混沌的外部磁场开关控制

研究了强流离子束在周期聚焦磁场通道中束晕-混沌的外部磁场开关参数控制方法. 将该方法应用在多粒子模型中，实现了对5种不同初始分布质子束的束晕-混沌的有效控制，得到了消除束晕及其再生现象的理想结果.在强流加速器系统中，由于外部磁场是可测和可调 的物理量，因此该控制方法有利于实验研究，可为强流质子加速器中周期聚焦磁场的设计和实验提供参考. 关键词： 强流离子束 周期聚焦磁场通道 束晕_混沌 混沌控制 开 关控制     

Allocating electricity transmission costs through tracing: a game-theoretic rationale

Tracing is a method of assigning flows in an electricity network to particular generators and loads, assuming perfect mixing at each node. It can be used to assign costs to transmission users. We show that the resulting allocation is equal to the Shapley value of an equivalent co-operative game.     

Compensatory transfers in two-player decision problems

This paper presents an axiomatic characterization of a family of solutions to two-player quasi-linear social choice problems. In these problems the players select a single action from a set available to them. They may also transfer money between themselves.The solutions form a one-parameter family, where the parameter is a non-negative number, t.The solutions can be interpreted as follows: Any efficient action can be selected. Based on this action, compute for each player a “best claim for compensation”. A claim for compensation is the difference between the value of an alternative action and the selected efficient action, minus a penalty proportional to the extent to which the alternative action is inefficient. The coefficient of proportionality of this penalty is t. The best claim for compensation for a player is the maximum of this computed claim over all possible alternative actions. The solution, at the parameter value t, is to implement the chosen efficient action and make a monetary transfer equal to the average of these two best claims. The characterization relies on three main axioms. The paper presents and justifies these axioms and compares them to related conditions used in other bargaining contexts. In Nash Bargaining Theory, the axioms analogous to these three are in conflict with each other. In contrast, in the quasi-linear social choice setting of this paper, all three conditions can be satisfied simultaneously.This work was supported by the Division of Research at the Harvard Business School. Thanks are due to the Cowles Foundation for Research in Economics at Yale University for its kind hospitality during the Spring of 2002. I have received helpful advice and comments from Youngsub Chun, Ehud Kalai, Herve Moulin, Al Roth, Ilya Segal, Adam Szeidl, Richard Zeckhauser, and other members of the Theory Seminars at Harvard, MIT, Princeton, Rice and Northwestern.